Scope-Bounded Pushdown Languages
نویسندگان
چکیده
We study the formal language theory of multistack pushdown automata (Mpa) restricted to computations where a symbol can be popped from a stack S only if it was pushed within a bounded number of contexts of S (scoped Mpa). We show that scoped Mpa are indeed a robust model of computation, by focusing on the corresponding theory of visibly Mpa (Mvpa). We prove the equivalence of the deterministic and nondeterministic versions and show that scope-bounded computations of an n-stack Mvpa can be simulated, rearranging the input word, by using only one stack. These results have some interesting consequences, such as, the closure under complement, the decidability of universality, inclusion and equality, and the effective semilinearity of the Parikh image (Parikh’s theorem). As a further contribution, we give a logical characterization and compare the expressiveness of the scope-bounded restriction with other Mvpa classes from the literature. To the best of our knowledge, scoped Mvpa languages form the largest class of formal languages accepted by Mpa that enjoys all the above nice properties.
منابع مشابه
Single letter languages accepted by alternating and probabilistic pushdown automata
We consider way k tape alternating pushdown automata k apa and way k tape alternating nite automata k afa We say that an alternating automaton accepts a language L with f n bounded maximal respectively minimal leaf size if arbitrary re spectively at least one accepting tree for any w L has no more than f jwj leaves The main results of the article are the following For way k tape alternating cou...
متن کاملPushdown dimension
Resource-bounded dimension is a notion of computational information density of infinite sequences based on computationally bounded gamblers. This paper develops the theory of pushdown dimension and explores its relationship with finite-state dimension. The pushdown dimension of any sequence is trivially bounded above by its finite-state dimension, since a pushdown gambler can simulate any finit...
متن کاملOn probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملSaturation of Concurrent Collapsible Pushdown Systems
Multi-stack pushdown systems are a well-studied model of concurrent computationusing threads with first-order procedure calls. While, in general, reachability is unde-cidable, there are numerous restrictions on stack behaviour that lead to decidability.To model higher-order procedures calls, a generalisation of pushdown stacks called col-lapsible pushdown stacks are required. Re...
متن کاملScope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width
We present a novel fixed-point algorithm to solve reachability of multi-stack pushdown systems restricted to runs of bounded-scope. The followed approach is compositional, in the sense that the runs of the system are summarized by bounded-size interfaces. Moreover, it is suitable for a direct implementation and can be exploited to prove two new results. We give a sequentialization for this clas...
متن کامل